Orthogonal Latin Rectangles
نویسندگان
چکیده
منابع مشابه
Orthogonal Latin Rectangles
We use a greedy probabilistic method to prove that for every > 0, every m × n Latin rectangle on n symbols has an orthogonal mate, where m = (1− )n. That is, we show the existence of a second latin rectangle such that no pair of the mn cells receives the same pair of symbols in the two rectangles.
متن کاملCounting Three-Line Latin Rectangles
A k × n Latin rectangle is a k × n array of numbers such that (i) each row is a permutation of [n] = {1, 2, . . . , n} and (ii) each column contains distinct entries. If the first row is 12 · · ·n, the Latin rectangle is said to be reduced. Since the number k × n Latin rectangles is clearly n! times the number of reduced k× n Latin rectangles, we shall henceforth consider only reduced Latin rec...
متن کاملAsymptotic enumeration of Latin rectangles
A k X n Latin rectangle is a k X n matrix with entries from {1,2,.. . , n} such that no entry occurs more than once in any row or column. (Thus each row is a permutation of the integers 1,2,..., n.) Let L(k, n) be the number of k x n Latin rectangles. An outstanding problem is to determine the asymptotic value of L(k, n) as n —• oo, with k bounded by a suitable function of n. The first attack o...
متن کاملOn orthogonal generalized equitable rectangles
In this note, we give a complete solution of the existence of orthogonal generalized equitable rectangles, which was raised as an open problem in [4].
متن کاملEnumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
The current paper deals with the enumeration and classification of the set SORr,n of self-orthogonal r × r partial Latin rectangles based on n symbols. These combinatorial objects are identified with the independent sets of a Hamming graph and with the zeros of a radical zero-dimensional ideal of polynomials, whose reduced Gröbner basis and Hilbert series can be computed to determine explicitly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2008
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548307008590